Infinite families of crossing-critical graphs with a given crossing number
نویسندگان
چکیده
منابع مشابه
Infinite families of crossing-critical graphs with prescribed average degree and crossing number
iráň constructed infinite families of k-crossing-critical graphs for every k ≥ 3 and Kochol constructed such families of simple graphs for every k ≥ 2. Richter and Thomassen argued that, for any given k ≥ 1 and r ≥ 6, there are only finitely many simple k-crossingcritical graphs with minimum degree r. Salazar observed that the same argument implies such a conclusion for simple k-crossing-critic...
متن کاملNew Infinite Families of Almost-Planar Crossing-Critical Graphs
We show that, for all choices of integers k > 2 and m, there are simple 3connected k-crossing-critical graphs containing more than m vertices of each even degree ≤ 2k − 2. This construction answers one half of a question raised by Bokal, while the other half asking analogously about vertices of odd degrees at least 7 in crossing-critical graphs remains open. Furthermore, our newly constructed g...
متن کاملCrossing Number Graphs
In 1940, the Hungarian mathematician Paul Turán was sent to a forced labor camp by the Nazis. Though every part of his life was brutally controlled, he still managed to do serious mathematics under the most extreme conditions. While forced to collect wire from former neighborhoods, he would be thinking about mathematics. When he found scraps of paper, he wrote down his theorems and conjectures....
متن کاملOn Degree Properties of Crossing-Critical Families of Graphs
Answering an open question from 2007, we construct infinite k-crossing-critical families of graphs which contain arbitrarily often vertices of any prescribed odd degree, for sufficiently large k. From this we derive that, for any set of integers D such that min(D) ≥ 3 and 3, 4 ∈ D, and for all sufficiently large k there exists an infinite k-crossing-critical family such that the numbers in D ar...
متن کاملCrossing Number of Toroidal Graphs
It is shown that if a graph of n vertices can be drawn on the torus without edge crossings and the maximum degree of its vertices is at most d, then its planar crossing number cannot exceed cdn, where c is a constant. This bound, conjectured by Brass, cannot be improved, apart from the value of the constant. We strengthen and generalize this result to the case when the graph has a crossing-free...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1984
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90140-7